// Package coding_round_1 day_01_stack_for_after_range_tree
// @Title coding_round_1
// @Description
// @Author  == 琳琳也叫王木木 ==  2021/9/2 11:55
// @Create  2021/9/2 11:55
package coding_round_1

// AfterRangeStack  使用栈实现二叉树的后序遍历
func AfterRangeStack(root *TreeNode) []int {
	if root == nil {
		return nil
	}
	ans := make([]int, 0)
	return ans
}
